Enlightenment on Computer Network Reliability From Transportation Network Reliability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research on Reliability Measurement Index of Urban Public Transportation Network Based on the Reliability Measure of Complex Network

Objective: To improve the reliability of complex urban public transportation network. Methods: Establishing the reliability evaluation system of urban public transportation network. Process: The paper introduces the development of urban traffic construction, describes the characteristic parameters of complex networks, and establishes the model of the reliability evaluation index system of compl...

متن کامل

Reliability estimation of Iran's power network

Today, the electricity power system is the most complicated engineering system has ever been made. The integrated power generating stations with power transmission lines has created a network, called complex power network. The reliability estimation of such complex power networks is a very challenging problem, as one cannot find any immediate solution methods in current literature. In this pape...

متن کامل

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

A note on network reliability

Let G = (V,E) be a loopless undirected multigraph, with a probability pe, 0 ≤ pe ≤ 1 assigned to every edge e ∈ E. Let Gp be the random subgraph of G obtained by deleting each edge e of G, randomly and independently, with probability qe = 1 − pe. For any nontrivial subset S ⊂ V let (S, S) denote, as usual, the cut determined by S, i.e., the set of all edges of G with an end in S and an end in i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Wireless and Microwave Technologies

سال: 2011

ISSN: 2076-1449,2076-9539

DOI: 10.5815/ijwmt.2011.03.03